To fold, first unfold

نویسنده

  • Richard Robinson
چکیده

The double-ringed GroEL chaperone complex is well-known for capturing partially folded proteins and confi ning them within its central cavity to facilitate folding. GroEL is especially important to proteins that have a complex folding pattern, such as Rubisco. A prominent model of GroEL function suggests that the chaperone fi rst partially unfolds its substrate, disrupting misfolded and inhibitory conformations, thus giving them a chance to refold properly once inside the chaperone cavity. But the importance of this effect for successful refolding has been unclear. To explore this question, the authors tagged the two loose ends of partially folded Rubisco for FRET analysis. They found that the two ends of Rubisco were close upon initial binding to the open end of GroEL. But when ATP bound to the complex and triggered a GroEL conformational change, the Rubisco ends separated. The same conformation change allowed the complex to bind GroES, GroEL’s smaller partner, thereby causing Rubisco to enter the cavity. But did this unfolding aid in proper folding? ATP-driven unfolding works too fast to answer that question, so the authors examined the slower, passive unfolding of Rubisco on a single-ringed form of GroEL called SR1. By incubating Rubisco with SR1 for varying lengths of time before adding ATP and GroES, they showed that more time with SR1, and therefore more time to unfold before entering the SR1 cavity, produced a higher proportion of successfully folded Rubisco molecules. “We think this represents a really clean demonstration that unfolding can directly stimulate productive folding,” Rye says.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Survey of Program Transformation With Special Reference to Unfold/Fold Style Program Development

This paper consists of a survey of current, and past, work on program transformation for the purpose of optimization. We first discuss some of the general methodological frameworks for program modification, such as analogy, explanation based learning, partial evaluation, proof theoretic optimization, and the unfold/fold technique. These frameworks are not mutually exclusive, and the latter, unf...

متن کامل

Constructively Characterizing Fold and Unfold

In this paper we formally state and prove theorems characterizing when a function can be constructively reformulated using the recursion operators fold and unfold, i.e. given a function h, when can a function g be constructed such that h = fold g or h = unfold g? These results are refinements of the classical characterization of fold and unfold given by Gibbons, Hutton and Altenkirch in [6]. Th...

متن کامل

Synthesis and Transformation of Logic Programs Using Unfold/Fold Proofs

. We present a method for proving properties of definite logic programs. This method is called unfold/fold proof method because it is based on the unfold/fold transformation rules. Given a program P and two goals (that is, conjunctions of atoms) F (X,Y ) and G(X,Z), where X, Y , and Z are pairwise disjoint vectors of variables, the unfold/fold proof method can be used to show that the equivalen...

متن کامل

A. Pettorossi, M. Proietti SYNTHESIS AND TRANSFORMATION OF LOGIC PROGRAMS USING UNFOLD/FOLD PROOFS R. 457 Giugno 1997

We present a method for proving properties of definite logic programs. This method is called unfold/fold proof method because it is based on the unfold/fold transformation rules. Given a program P and two goals (that is, conjunctions of atoms) F (X, Y ) and G(X, Z), where X, Y , and Z are pairwise disjoint vectors of variables, the unfold/fold proof method can be used to show that the equivalen...

متن کامل

A Parameterized Unfold/Fold Transformation Framework for De nite Logic Programs

Given a program P , an unfold/fold program transformation system derives a sequence of programs P = P0, P1, : : : , Pn, such that Pi+1 is derived from Pi by application of either an unfolding or a folding step. Existing unfold/fold transformation systems for de nite logic programs di er from one another mainly in the kind of folding transformations they permit at each step. Some allow folding u...

متن کامل

A Fold/Unfold Transformation Framework for Rewrite Theories and its Application to CCT

Many transformation systems for program optimization, program synthesis, and program specialization are based on fold/unfold transformations. In this paper, we present a fold/unfold–based transformation framework for rewriting logic theories which is based on narrowing. For the best of our knowledge, this is the first fold/unfold transformation framework which allows one to deal with functions,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • The Journal of Cell Biology

دوره 180  شماره 

صفحات  -

تاریخ انتشار 2008